2‐Cyanoprop‐2‐yl dithiobenzoate mediated reversible addition–fragmentation chain transfer polymerization of acrylonitrile targeting a polymer with a higher molecular weight

The reversible addition–fragmentation chain transfer (RAFT) polymerization of acrylonitrile (AN) mediated by 2‐cyanoprop‐2‐yl dithiobenzoate was first applied to synthesize polyacrylonitrile (PAN) with a high molecular weight up to 32,800 and a polydispersity index as low as 1.29. The key to success was ascribed to the optimization of the experimental conditions to increase the fragmentation reaction efficiency of the intermediate radical. In accordance with the atom transfer radical polymerization of AN, ethylene carbonate was also a better solvent candidate for providing higher controlled/living RAFT polymerization behaviors than dimethylformamide and dimethyl sulfoxide. The various experimental parameters, including the temperature, the molar ratio of dithiobenzoate to the initiator, the molar ratio of the monomer to dithiobenzoate, the monomer concentration, and the addition of the comonomer, were varied to improve the control of the molecular weight and polydispersity index. The molecular weights of PANs were validated by gel permeation chromatography along with a universal calibration procedure and intrinsic viscosity measurements. ¹H NMR analysis confirmed the high chain‐end functionality of the resultant polymers. © 2007 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 45: 1272–1281, 2007     

压差式矢量水听器方位估计中的干扰抵消

矢量水听器由于能获取声场中标量（声压）和矢量（振速）信息，因此单个的矢量水听器就可实现目标方位估计。单个矢量水听器是利用信号的声压和质点振速之间相关性进行信号方位估计，但是当存在干扰，并且干扰和信号之间相关时，如果对运用能量流进行方位估计的方法不加改进，则会出现很大的误差，甚至出现错误的估计。本文提出一种存在已知噪声干扰情况下的干扰抵消方法，并针对该方法进行了仿真试验，最后运用湖试数据进行了验证。结果表明，该方法能有效地减弱相千千柑对信号的影响，实现对信号的方位估计。     

向量变分不等式的严格可行性问题

本篇文章首先定义了向量变分不等式的严格可行点概念,其次在假设了映射是强(D)-伪单调的情况下,证明了向量变分不等式解集非空有界与其严格可行点存在的等价性问题,推广了在数量变分不等式上得到的相应结果．     

Representations, convolution square roots and spherical vectors

We extend results on square integrable representations of a locally compact group to subrepresentations of a representations induced from a character of a closed subgroup. We do so working in the framework of quotient representations of ∗-algebras.     

Measurability criteria for fuzzy random vectors

Fuzzy random vector is a measurable map from a probability space to a collection of fuzzy vectors. Our aim in this paper is to discuss the measurability criteria for fuzzy random vectors, and show that under mild assumption, the measurability criteria for upper semicontinuous fuzzy random vectors can be expressed in several different but equivalent formulations. Finally, applying the obtained results, we resolve an open problem about the relationship between fuzzy random vectors and fuzzy random variables.     

Feature Selection using Fuzzy Support Vector Machines

The feature selection consists of obtaining a subset of these features to optimally realize the task without the irrelevant ones. Since it can provide faster and cost-effective learning machines and also improve the prediction performance of the predictors, it is a crucial step in machine learning. The feature selection methods using support machines have obtained satisfactory results, but the noises and outliers often reduce the performance. In this paper, we propose a feature selection approach using fuzzy support vector machines and compare it with the previous work, the results of experiments on the UCI data sets show that feature selection using fuzzy SVM obtains better results than using SVM.     

Adaptive application of operators in standard representation

Recently adaptive wavelet methods have been developed which can be shown to exhibit an asymptotically optimal accuracy/work balance for a wide class of variational problems including classical elliptic boundary value problems, boundary integral equations as well as certain classes of noncoercive problems such as saddle point problems. A core ingredient of these schemes is the approximate application of the involved operators in standard wavelet representation. Optimal computational complexity could be shown under the assumption that the entries in properly compressed standard representations are known or computable in average at unit cost. In this paper we propose concrete computational strategies and show under which circumstances this assumption is justified in the context of elliptic boundary value problems. Dedicated to Charles A. Micchelli on the occasion of his 60th birthday Mathematics subject classifications (2000) 41A25, 41A46, 65F99, 65N12, 65N55. This work has been supported in part by the Deutsche Forschungsgemeinschaft SFB 401, the first and third author are supported in part by the European Community's Human Potential Programme under contract HPRN-CT-202-00286 (BREAKING COMPLEXITY). The second author acknowledges the financial support provided through the European Union's Human Potential Programme, under contract HPRN-CT-2002-00285 (HASSIP) and through DFG grant DA 360/4–1.     

Pro-torus actions on Poincaré duality spaces

In this paper, it is shown that some of the results of torus actions on Poincaré duality spaces, Borel’s dimension formula and topological splitting principle to local weights, hold if ‘torus’ is replaced by ‘pro-torus’.     

场源基本微元的对称性与场的性质

直接由标量基本微元（点源）和矢量基本微元（电流元等）的对称性和两个基本假设讨论基本微元产生的场矢量的性质。     

Vector-Orthogonality and Lanczos-Type Methods

A method for solving a linear system is defined. It is a Lanczos-type method, but it uses formal vector orthogonality instead of scalar orthogonality. Moreover, the dimension of vector orthogonality may vary which gives a large freedom in leading the algorithm, and controlling the numerical problems. The ideas of truncated and restarted methods are revisited. The obtained residuals are exactly orthogonal to a space of increasing dimension. Some experiments are done, the problem of finding automaticaly good directions of projection remains partly open.